Turing number

Reversible Turing machines with a small number of states

Turing and the Riemann Hypothesis, Volume 53, Number 10

The calculations had been planned some time in advance, but had in fact to be carried out in great haste. If it had not been for the fact that the computer remained in serviceable condition for an unusually long period from 3 p.m. one afternoon to 8 a.m. the following morning it is probable that the calculations would never have been done at all. As it was, the interval 2π.632 < t < 2π.642 was ...

Book Review: The Essential Turing, Volume 53, Number 10

The Essential Turing is a selection of writings of the British mathematician Alan M. Turing (1912–1954). Extended introductions and annotations are added by the editor, the New Zealand philosopher B. Jack Copeland, and there are some supplementary papers and commentaries by other authors. Alan Tur-ing was the founder of the theory of computabil-ity, with his paper " On Computable numbers, with ...

Turing Tests with Turing Machines

Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like to have a Turing Test where the reference a...

Alan Turing Universal Turing Machine

In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.